Challenges: Arrivals, Departures, Destruction, Debate
نویسندگان
چکیده
منابع مشابه
Scheduling in Wireless Networks with Connection Arrivals and Departures
We consider wireless ad hoc networks in which each connection (file) traverses only one hop. We assume that files arrive for service at each link and a file departs when all its packets have been transmitted. The file size distribution can be arbitrary, but the file sizes are assumed to be bounded. We assume that a window flow control protocol regulates the injection of packets from each file i...
متن کاملOptimal Integration of Departures and Arrivals in Terminal Airspace
Coordination of operations with spatially and temporally shared resources, such as route segments, fixes, and runways, improves the efficiency of terminal airspace management. Problems in this category are, in general, computationally difficult compared to conventional scheduling problems. This paper presents a fast time algorithm formulation using a non-dominated sorting genetic algorithm (NSG...
متن کاملA game theoretic model of kleptoparasitism with strategic arrivals and departures of beetles at dung pats.
Dung beetles Onthophagus taurus lay their eggs in brood balls within dung pats. The dung that is used must be sufficiently fresh, and so beetles must keep moving from pat to pat to find fresh dung. If another beetle finds a brood ball it will usually eat the egg inside and lay its own egg in the brood ball instead of constructing its own ball. Thus, beetles will often stay near their eggs to gu...
متن کاملReal-time scheduling of aircraft arrivals and departures in a terminal maneuvering area
The Aircraft Scheduling Problem (ASP) is the real-time problem of scheduling take-off and landing operations at a congested airport in a given time horizon, taking into account the runways and the air segments in the Terminal Maneuvering Area (TMA). The ASP can be viewed as a job shop scheduling problem with additional real-world constraints. Compared with the current literature based on job sh...
متن کاملSimulation of File Arrivals and Departures on Buffer sizing in Access Routers
Most of the contemporary systems assumes that all the flow of packets are same and requires O(1) buffer size for transferring packets in a network. This leads to more buffer size even for short flow of packets also, which wastes the buffer size. To overcome this problem, this paper proposes a new technique which uses different buffer sizes based on the packet flows. For long packet flows longer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archaeologies
سال: 2020
ISSN: 1555-8622,1935-3987
DOI: 10.1007/s11759-020-09407-6